Implementation of Parallel Fast Hartley Transform (FHT) Using Cuda

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Implementation of Scale Invariant Feature Transform Based on CUDA

Scale-invariant feature transform (SIFT) was an algorithm in computer vision to detect and describe local features in images. Due to its excellent performance, SIFT was widely used in many applications, but the implementation of SIFT was complicated and time-consuming. To solve this problem, this paper presented a novel acceleration algorithm for SIFT implementation based on Compute Unified Dev...

متن کامل

Radix-2 Fast Hartley Transform Revisited

A Fast algorithm for the Discrete Hartley Transform (DHT) is presented, which resembles radix-2 fast Fourier Transform (FFT). Although fast DHTs are already known, this new approach bring some light about the deep relationship between fast DHT algorithms and a multiplication-free fast algorithm for the Hadamard Transform. Key-words Discrete transforms, Hartley transform, Hadamard Transform.

متن کامل

Arbitrary-length Fast Hartley Transform without Multiplications

Discrete Hartley transform (DHT) is an important tool in digital signal processing. In this paper, a multilierless algorithm to compute discrete Hartley transforms is proposed, which can deal with arbitrary length input signals. The proposed algorithm can be implemented by integer additions of fixed points in binary system. Besides, an efficient and regular systolic array is designed to impleme...

متن کامل

Image Compression using Hartley transform

The report presents a novel approach for image compression using the Hartley transform (HT). The Hartley transform has the advantage of solving the problem of phase wrapping from which the Fourier transform suffers. The magnitude and phase compression using this transformation (HT) have proved better performance than those of the Fourier Transform. Magnitude and phase were processed separately....

متن کامل

Parallel Implementation of Similarity Measures on GPU Architecture using CUDA

Image processing and pattern recognition algorithms take more time for execution on a single core processor. Graphics Processing Unit (GPU) is more popular now-a-days due to their speed, programmability, low cost and more inbuilt execution cores in it. Most of the researchers started work to use GPUs as a processing unit with a single core computer system to speedup execution of algorithms and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer Sciences and Applications

سال: 2014

ISSN: 2328-7268

DOI: 10.12691/jcsa-2-1-2